A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
نویسندگان
چکیده
منابع مشابه
A 3-Stranded Quantum Algorithm for the Jones Polynomial
The first algorithm, called the classical 3-stranded braid (3-SB) algorithm, is a classical deterministic algorithm that has time complexity O (L). The second, called the quantum 3-SB algorithm, is a quantum algorithm that computes an estimate of VK (exp (iφ)) within a precision of ǫ1 with a probability of success bounded below by 1− ǫ2. The execution time complexity of this algorithm is O (nL)...
متن کاملQuantum Algorithms for the Jones Polynomial
This paper gives a generalization of the AJL algorithm for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle for the Jones parameter. We show that the Kauffman-Lomonaco 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm.
متن کاملQuantum Field Theory and the Jones Polynomial
It is shown that 2 + 1 dimensional quantum Yang-Mills theory, with an action consisting purely of the Chern-Simons term, is exactly soluble and gives a natural framework for understanding the Jones polynomial of knot theory in three dimensional terms. In this version, the Jones polynomial can be generalized from S to arbitrary three manifolds, giving invariants of three manifolds that are compu...
متن کاملThe BQP-hardness of approximating the Jones Polynomial
Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficient quantum algorithm for approximating the Jones polynomial of the plat closure of a braid, at the kth root of unity, for constant k. The universality proof of Freedman, Larsen and Wang [2] implies that the problem which these algorithms solve is BQP-hard. The fact that this ...
متن کاملQuantum Algorithms Beyond the Jones Polynomial
The quantum algorithm of AJL [3] (following the work of Freedman et al. [10]) to approximate the Jones polynomial, is of a new type: rather than using the quantum Fourier transform, it encodes the local combinatorial structure of the problem by the relations of an algebra, called the Temperley-Lieb algebra, whose matrix representation is then applied, using a quantum computer. By the results of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2008
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-008-9168-0